Associative Data Storage and Retrieval in Neural Networks 1.1 Introduction and Overview

نویسنده

  • Friedrich T. Sommer
چکیده

Associative storage and retrieval of binary random patterns in various neural net models with one-step threshold-detection retrieval and local learning rules are the subject of this paper. For diierent hetero-association and auto-association memory tasks, speciied by the properties of the pattern sets to be stored and upper bounds on the retrieval errors, we compare the performance of various models of nite as well as asymptoti-cally innnite size. In innnite models, we consider the case of asymptotically sparse patterns, where the mean activity in a pattern vanishes, and study two asymptotic delity requirements: constant error probabilities and vanishing error probabilities. A signal-to-noise ratio analysis is carried out for one retrieval step where the calculations are comparatively straightforward and easy. As performance measures we propose and evaluate information capacities in bits/synapse which also take into account the important property of fault tolerance. For auto-association we compare one-step and xed-point retrieval that is analyzed in the literature by methods of statistical mechanics. With growing experimental insight in the anatomy of the nervous system as well as the rst electrophysiological recordings of nerve cells in the rst half of this century, a new theoretical eld was opened, namely, the modelling of the experimental ndings at one or a few nerve cells, leading to very detailed models of biological neurons 1]. But diierent from most biological phenomena, where the macroscopic function can be understood by revealing the cellular mechanism, the function of the nervous system as a whole turned out to be constituted by the collective behaviour of a very large number of nerve cells and the activity of a large fraction of cells, a ii 1. Associative Data Storage and Retrieval in Neural Networks whole activity pattern, had to be considered instead. The modelling had to drop the biological faithfullness at two points: on the cellular level the models had to be simpliied such that a large number of nerve cells could be described and on the macroscopic level the function had to be reduced to simple activity pattern processing like pattern completion, pattern recognition or pattern classiication allowing a theoretical description and quantiication. McCulloch and Pitts 2] argued that due to the \all or none" character of nervous activity the neurophysiological ndings can be reproduced in models with simple two-state neurons, in particular, in associative memory models which exhibit binary activity patterns. In the ftees and sixtees small feed-forward neural nets have been …

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Self-Reconstructing Algorithm for Single and Multiple-Sensor Fault Isolation Based on Auto-Associative Neural Networks

Recently different approaches have been developed in the field of sensor fault diagnostics based on Auto-Associative Neural Network (AANN). In this paper we present a novel algorithm called Self reconstructing Auto-Associative Neural Network (S-AANN) which is able to detect and isolate single faulty sensor via reconstruction. We have also extended the algorithm to be applicable in multiple faul...

متن کامل

Enhanced storage capacity with errors in scale-free Hopfield neural networks: An analytical study

The Hopfield model is a pioneering neural network model with associative memory retrieval. The analytical solution of the model in mean field limit revealed that memories can be retrieved without any error up to a finite storage capacity of O(N), where N is the system size. Beyond the threshold, they are completely lost. Since the introduction of the Hopfield model, the theory of neural network...

متن کامل

An evaluation of standard retrieval algorithms and a binary neural approach

In this paper we evaluate a selection of data retrieval algorithms for storage efficiency, retrieval speed and partial matching capabilities using a large Information Retrieval dataset. We evaluate standard data structures, for example inverted file lists and hash tables, but also a novel binary neural network that incorporates: single-epoch training, superimposed coding and associative matchin...

متن کامل

High Order Neural Networks for Efficient Associative Memory Design

We propose learning rules for recurrent neural networks with high-order interactions between some or all neurons. The designed networks exhibit the desired associative memory function: perfect storage and retrieval of pieces of information and/or sequences of information of any complexity.

متن کامل

Robust image retrieval from noisy inputs using lattice associative memories

Lattice associative memories also known as morphological associative memories are fully connected feedforward neural networks with no hidden layers, whose computation at each node is carried out with lattice algebra operations. These networks are a relatively recent development in the field of associative memories that has proven to be an alternative way to work with sets of pattern pairs for w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995